Minimum Dependence Distance Tiling of Nested Loops with Non-uniform Dependences Parallel and Distributed Computing Laboratory

نویسنده

  • Vipin Chaudhary
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum dependence distance tiling of nested loops with non-uniform dependences

In this paper we address the problem of partitioning nested loops with non-uniform (irregular) dependence vectors. Although many methods exist for nested loop partitioning, most of these perform poorly when parallelizing nested loops with irregular dependences. We apply the results of classical convex theory and principles of linear programming to iteration spaces and show the correspondence be...

متن کامل

Compile Time Partitioning of Nested Loop Iteration Spaces with Non-uniform Dependences*

In this paper we address the problem of partitioning nested loops with non-uniform (irregular) dependence vectors. Parallelizing and partitioning of nested loops requires efficient inter-iteration dependence analysis. Although many methods exist for nested loop partitioning, most of these perform poorly when parallelizing nested loops with irregular dependences. Unlike the case of nested loops ...

متن کامل

Improving Parallelism of Nested Loops with Non-uniform Dependences

This paper defines the properties of FDT (Flow Dependence Tail set) and FDH (Flow Dependence Head set), and presents two partitioning methods for finding two parallel regions in two-dimensional solution space. One is the region partitioning method by intersection of FDT and FDH. Another is the region partitioning method by two given equations. Both methods show how to determine whether the inte...

متن کامل

Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops

This paper presents a new approach for computing the transitive closure of a union of relations describing all the dependences in both uniform and quasi-uniform perfectly-nested parameterized loops. This approach is based on calculating the basis of a dependence distance vectors set. The procedure has polynomial time complexity for most steps of calculations. This allows us to effectively extra...

متن کامل

Automatic Parallelization of Non-uniform Dependences

This report summarizes our current experiences with Automatic Program Parallelization tools for converting sequential Fortran code for use on a multiprocessor computer. A number of such tools were evaluated, including Parafrase, Adaptor, PAT, Petit and the SUIF compiler package. We evaluated the suitability of such tools for parallelizing Computational Fluid Dynamics code supplied by the Army R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994